首页> 外文OA文献 >Provable security of block ciphers against linear cryptanalysis: a mission impossible?
【2h】

Provable security of block ciphers against linear cryptanalysis: a mission impossible?

机译:针对线性密码分析的分组密码可证明的安全性:不可能完成的任务吗?

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper, we are concerned with the security of block ciphers against linear cryptanalysis and discuss the distance between the so-called practical security approach and the actual theoretical security provided by a given cipher. For this purpose, we present a number of illustrative experiments performed against small (i.e. computationally tractable) ciphers. We compare the linear probability of the best linear characteristic and the actual best linear probability (averaged over all keys). We also test the key equivalence hypothesis. Our experiments illustrate both that provable security against linear cryptanalysis is not achieved by present design strategies and the relevance of the practical security approach. Finally, we discuss the (im)possibility to derive actual design criteria from the intuitions underlined in these experiments.
机译:在本文中,我们关注针对线性密码分析的分组密码的安全性,并讨论了所谓的实际安全性方法与给定密码提供的实际理论安全性之间的距离。为此目的,我们提出了许多针对小型(即计算上易于处理的)密码的示例性实验。我们将最佳线性特征的线性概率与实际最佳线性概率(在所有键上平均)进行比较。我们还测试了关键等价假设。我们的实验表明,目前的设计策略无法实现针对线性密码分析的可证明安全性,以及实际安全性方法的相关性。最后,我们讨论了从这些实验所强调的直觉中得出实际设计标准的可能性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号